Query Rewriting for Horn-SHIQ Plus Rules

Query answering over Description Logic (DL) ontologies has become a vibrant field of research. Efficient realizations often exploit database technology and rewrite given query to an equivalent SQL or Datalog associated with the ontology. This approach been intensively studied for conjunctive in DL-Lite EL families, but is much less explored more expressive DLs queries. We present rewriting-based algorithm Horn-SHIQ ontologies, possibly extended recursive rules under limited recursion as DL+log. setting not only subsumes both EL, also yields (limited) queries (an undecidable problem full queries). A prototype implementation shows its potential applications, experiments exhibit efficient benign downscaling DL-Lite, where it competitive comparable state art systems.